Formal Proofs for Global Optimization - Templates and Sums of Squares. (Preuves formelles pour l'optimisation globale - Méthodes de gabarits et sommes de carrés)
نویسنده
چکیده
منابع مشابه
La combinaison d'UML avec la méthode formelle CSP-OZ pour le développement d'applications bases des données
Les méthodes utilisées pour la spécification et le développement d’applications de bases de données sont basées soit sur les notations graphiques (appelées méthodes semi-formelles) soit sur des notations mathématiques (appelées méthodes formelles). Les méthodes semi-formelles (E-R, UML, OMT,...) (Jacobson et al., 2005) permettent une représentation intuitive et synthétique du système à étudier....
متن کاملAdditive Representation in Thin Sequences, I: Waring’s Problem for Cubes
– In this paper we investigate representation of numbers from certain thin sequences like the squares or cubes by sums of cubes. It is shown, in particular, that almost all values of an integral cubic polynomial are sums of six cubes. The methods are very flexible and may be applied to many related problems. 2001 Éditions scientifiques et médicales Elsevier SAS RÉSUMÉ. – Dans cet article nous...
متن کاملExtracting Text from Proofs
In this paper, we propose a method for presenting formal proofs in an intelligible form. We describe a transducer from proof objects (terms in the Calculus of Constructions) to pseudo natural language that has been implemented for the Coq system Extraction de Texte a partir de Preuves R esum e : Ce papier pr esente une m ethode pour produire a partir de preuves formelles une explication textuel...
متن کاملTableaux and plane partitions of truncated shapes ( extended abstract )
We consider a new kind of straight and shifted plane partitions/Young tableaux — ones whose diagrams are no longer of partition shape, but rather Young diagrams with boxes erased from their upper right ends. We find formulas for the number of standard tableaux in certain cases, namely a shifted staircase without the box in its upper right corner, i.e. truncated by a box, a rectangle truncated b...
متن کاملCounting words with Laguerre polynomials
We develop a method for counting words subject to various restrictions by finding a combinatorial interpretation for a product of formal sums of Laguerre polynomials. We use this method to find the generating function for k-ary words avoiding any vincular pattern that has only ones. We also give generating functions for k-ary words cyclically avoiding vincular patterns with only ones whose runs...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013